On the role of distributed computing in Symbolic Computation for Algebraic Topology

نویسندگان

  • M. Pascual
  • V. Romero
  • Rubio
چکیده

In this work, we report on the preliminary analysis carried out in order to undertake the task of designing and building distributed systems for Symbolic Computation in Algebraic Topology. We try to make explicit how the peculiarities of the programs computing homology and homotopy groups can influence on the development of distributed systems to perform the same calculations. We stress not only on the (well-known) benefits of distributed computing, but also in the challenges and difficulties that appear due to the distinctive characteristics of our domain of computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remote Access to a Symbolic Computation System for Algebraic Topology: A Client-Server Approach

Kenzo is a Symbolic Computation system created by Sergeraert for computing in Algebraic Topology. It is programmed in Common Lisp and this programming language also acts as user interface. In this paper, a prototype to provide remote access for Kenzo is presented. This has been accomplished by using Corba technology: clients have been developed both in Java and Common Lisp (the server is always...

متن کامل

Distributed Computing in Algebraic Topology: first trials

Nowadays, Internet appears as a suitable tool for performing scientific computations in a distributed collaborative way. One of the fields where this idea can be applied is that of Symbolic Computation. Computer Algebra packages are being extended to interconnect them. In fact, some Computer Algebra systems are already capable of performing distributed computing. An example is Distributed Maple...

متن کامل

Calcul effectif de la topologie de courbes et surfaces algébriques réelles. (On the Computation of The Topology of Real Algebraic Curves and Surfaces)

In this thesis, we got interested into the Effective Computation of the Topology of Real Algebraic Curves and Surfaces. One can distinguish three main new algorithms in the field of shape representation. Our first algorithm is a certified symbolic-numerical based on sub-resultants properties and computes the topology of a plane algebraic curve with the best known complexity. The second algorith...

متن کامل

A Worst-case Bound for Topology Computation of Algebraic Curves

Computing the topology of an algebraic plane curve C means to compute a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with coefficients bounded by 2ρ , the topology of the induced curve can be computed with Õ(n8(n+ρ2)) bit operations deterministically, and with Õ(n8ρ2) bit operations with a randomized algorithm in e...

متن کامل

Computing with locally effective matrices

Z N×N = {f : N× N → Z}). Then, several undecidability results are established, leading to a convenient data structure for effective machine computations. We call this data structure a locally effective matrix. We study when (and how) the standard matrix calculus (Ker and CoKer computations) can be extended to the infinite case. We find again several undecidability barriers. When these limitatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006